A note on dominating sets and average distance
نویسندگان
چکیده
منابع مشابه
A note on dominating sets and average distance
We show that the total domination number of a simple connected graph is greater than the average distance of the graph minus one-half, and that this inequality is best possible. In addition, we show that the domination number of the graph is greater than two-thirds of the average distance minus one-third, and that this inequality is best possible. Although the latter inequality is a corollary t...
متن کاملA Note on “on The Power Dominating Sets of Hypercubes”
1. Any vertex that is incident to an observed edge is observed. 2. Any edge joining two observed vertices is observed. The power domination problem is a variant of the classical domination problem in graphs and is defined as follows. Given an undirected graph G = (V, E), the problem is to find a minimum vertex set SP ⊆ V , called the power dominating set of G, such that all vertices in G are ob...
متن کاملA Note on Disjoint Dominating Sets in Graphs
The disjoint domination number γγ(G) of a graph G is the minimum cardinality of the union of two disjoint dominating sets in G. The disjoint independent domination number of a graph G is the minimum cardinality of the union of two disjoint independent dominating sets in G. In this paper we study these two parameters. We determine the value of γγ(G) for several graphs and give partial answers to...
متن کاملA New Optimality Measure for Distance Dominating Sets
We study the problem of finding the smallest power of an input graph that has k disjoint dominating sets, where the ith power of an input graph G is constructed by adding edges between pairs of vertices in G at distance i or less, and a subset of vertices in a graph G is a dominating set if and only if every vertex in G is adjacent to a vertex in this subset. The problem is a different view of ...
متن کاملOn convex sets that minimize the average distance
In this paper we study the compact and convex sets K ⊆ Ω ⊆ R that minimize ∫ Ω dist(x,K) dx + λ1V ol(K) + λ2Per(K) for some constants λ1 and λ2, that could eventually be zero. We compute in particular the second order derivative of the functional and use it to exclude smooth points of positive curvature for the problem with volume constraint. The problem with perimeter constraint behaves differ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.03.018